package com.binaryTree;

import java.util.Scanner;

public class LowestCommonAncestorofaBinarySearchTree0306_235 {

    //递归
    public TreeNode lowestCommonAncestor1(TreeNode root, TreeNode p, TreeNode q) {
        if(root.val > p.val && root.val > q.val) return lowestCommonAncestor(root.left,p,q);
        if(root.val < p.val && root.val < q.val) return lowestCommonAncestor(root.right,p,q);
        return root;
    }

    //迭代
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        while (true){
            if(root.val > p.val && root.val > q.val){
                root = root.left;
            } else if (root.val < p.val && root.val < q.val) {
                root = root.right;
            }else break;
        }
        return root;
    }
}
